Weakly $I$-semiregular Rings and $I$-semiregular Rings
نویسندگان
چکیده
منابع مشابه
Semiregular Large Sets
learned many things in the last several years that have helped me in several areas of this thesis. Along with the faculty, I would like to thank the office staff who do much in the department that is unseen, and have certainly done much for me personally. I would also like to thank Phil Romig for teaching me too many things to mention. Also, I would like to thank the members of my committee, Pr...
متن کاملAlgorithmic complexity of weakly semiregular partitioning and the representation number
A graph G is weakly semiregular if there are two numbers a, b, such that the degree of every vertex is a or b. The weakly semiregular number of a graph G, denoted by wr(G), is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is a weakly semiregular graph. We present a polynomial time algorithm to determine whether the weak...
متن کاملWEAKLY g(x)-CLEAN RINGS
A ring $R$ with identity is called ``clean'' if $~$for every element $ain R$, there exist an idempotent $e$ and a unit $u$ in $R$ such that $a=u+e$. Let $C(R)$ denote the center of a ring $R$ and $g(x)$ be a polynomial in $C(R)[x]$. An element $rin R$ is called ``g(x)-clean'' if $r=u+s$ where $g(s)=0$ and $u$ is a unit of $R$ and, $R$ is $g(x)$-clean if every element is $g(x)$-clean. In this pa...
متن کاملFinite p0-Semiregular Groups
About 60 years ago H. Zassenhaus 17] classiied nite near-elds. In doing so he also gave a full description of those nite groups which have a representation D (over C) such that D(g) has no eigenvalue 1 for any nontrivial element g 2 G. In our terminology such a group is called semiregular. One of the results in 17] characterizes SL 2 (5) as the only perfect semiregular group. Clearly, if the un...
متن کاملNormalized rational semiregular graphs
Let G be a graph and let A and D be the adjacency matrix of G and diagonal matrix of vertex degrees of G respectively. If each vertex degree is positive, then the normalized adjacency matrix of G is  = D−1/2AD−1/2. A classification is given of those graphs for which the all eigenvalues of the normalized adjacency matrix are integral. The problem of determining those graphs G for which λ ∈ Q fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Study
سال: 2021
ISSN: 2096-9856,2617-8702
DOI: 10.4208/jms.v54n4.21.09